public class HashBuck {

    static class Node{
        public int key;
        public int val;
        public Node next;

        public Node(int key,int val){
            this.val = val;
            this.key = key;
        }
    }

    public Node[] array = new Node[10];
    public int usedSize;

    public static final double DEFAULT_LOAD_FACTOR = 0.75f;

    public void push(int key,int val){
        int index = key % array.length;
        Node cur = array[index];
        while (cur != null){
            if (cur.key == key){
                cur.val = val;
                return;
            }
            cur = cur.next;
        }
        Node node = new Node(key, val);
        node.next = array[index];
        array[index] = node;
        usedSize++;
        if (doLoadFaactor() >= DEFAULT_LOAD_FACTOR){
            resize();
        }
    }

    private void resize(){
        Node[] newarray = new Node[2*array.length];

        for (int i = 0; i < array.length; i++) {
            Node cur = array[i];
            while (cur!= null){
                int newIndex = cur.key % newarray.length;
                Node curN = cur.next;
                cur.next = newarray[newIndex];
                newarray[newIndex] = cur;
                cur = curN;
            }
        }
        array = newarray;
    }


    private double doLoadFaactor(){
        return usedSize*1.0/ array.length;
    }


    public int getVal(int key){
        int index = key % array.length;
        Node cur = array[index];
        while (cur != null){
            if(cur.key == key){
                return cur.val;
            }
            cur = cur.next;
        }
        return -1;
    }

}
